## Uses of Class
oracle.pgx.api.Partition

- Packages that use Partition
  Package | Description
  --- | ---
  oracle.pgx.api | This package contains the Java APIs of PGX.

- - ### Uses of Partition in oracle.pgx.api

    Methods in oracle.pgx.api that return Partition
    Modifier and Type | Method and Description
    --- | ---
    `<ID extends Comparable<ID>> Partition<ID>` | Analyst.`communitiesLabelPropagation(PgxGraph graph)` Blocking version of `#communitiesLabelPropagationAsync()`.
    `<ID extends Comparable<ID>> Partition<ID>` | PgxGraph.`createComponents(VertexProperty<ID,Integer> components, int numComponents)` Blocking version of `#createComponentsAsync()`.
    `<ID extends Comparable<ID>> Partition<ID>` | Analyst.`sccKosaraju(PgxGraph graph)` Blocking version of `#sccKosarajuAsync()`.
    `<ID extends Comparable<ID>> Partition<ID>` | Analyst.`sccTarjan(PgxGraph graph)` Blocking version of `#sccTarjanAsync()`.
    `<ID extends Comparable<ID>> Partition<ID>` | Analyst.`wcc(PgxGraph graph)` Blocking version of `#wccAsync()`.

    Methods in oracle.pgx.api that return types with arguments of type Partition
    Modifier and Type | Method and Description
    --- | ---
    `<ID extends Comparable<ID>> PgxFuture<Partition<ID>>` | Analyst.`communitiesLabelPropagationAsync(PgxGraph graph)` Detect communities using parallel label propagation.
    `<ID extends Comparable<ID>> PgxFuture<Partition<ID>>` | PgxGraph.`createComponentsAsync(VertexProperty<ID,Integer> components, int numComponents)` Creates a `Partition` object holding a collection of vertex sets, each representing a component.
    `<ID extends Comparable<ID>> PgxFuture<Partition<ID>>` | Analyst.`sccKosarajuAsync(PgxGraph graph)` Find strongly connected components using Kosaraju's algorithm.
    `<ID extends Comparable<ID>> PgxFuture<Partition<ID>>` | Analyst.`sccTarjanAsync(PgxGraph graph)` Find strongly connected components using Tarjan's algorithm.
    `<ID extends Comparable<ID>> PgxFuture<Partition<ID>>` | Analyst.`wccAsync(PgxGraph graph)` Find weakly connected components through label propagation time complexity: O(E * D) with E = number of edges, D = diameter of the graph

    Methods in oracle.pgx.api with parameters of type Partition
    Modifier and Type | Method and Description
    --- | ---
    `<ID extends Comparable<ID>> Pair<Scalar<Double>,Scalar<Double>>` | Analyst.`partitionConductance(PgxGraph graph, Partition<ID> components)` Blocking version of `#partitionConductanceAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<Pair<Scalar<Double>,Scalar<Double>>>` | Analyst.`partitionConductanceAsync(PgxGraph graph, Partition<ID> partition)` Compute the conductance of a partition.
    `<ID extends Comparable<ID>> Scalar<Double>` | Analyst.`partitionModularity(PgxGraph graph, Partition<ID> components)` Blocking version of `#partitionModularityAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<Scalar<Double>>` | Analyst.`partitionModularityAsync(PgxGraph graph, Partition<ID> partition)` Compute the modularity of a partition.

Copyright © 2015. All rights reserved.